Strict pattern matching under non-overlapping condition

Pattern Matching under Polynomial Transformation

We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse as image processing and musical information processing where application specific transformations are often applied to the input. By considering the class of polynomial transformations of the input, we provide fast a...

Overlapping Domain Decomposition with Non - Matching Grids

The method of mothers for non-overlapping non-matching DDM

In this paper we introduce a variant of the three-field formulation where we use only two sets of variables. Considering, to fix the ideas, the homogeneous Dirichlet problem for −∆u = g in Ω, our variables are i) the approximations uh of u in each sub-domain Ωs (each on its own grid), and ii) an approximation ψh of u on the skeleton (the union of the interfaces of the sub-domains) on an indepen...

Approximate Geometric Pattern Matching Under Rigid Motions

We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal, and conduct experiments to show that the average performance of these matching algorithms is often better than that predicted by the worst-case bounds.

Geometric Pattern Matching Under Euclidean Motion

Given two planar sets A and B, we examine the problem of determining the smallest " such that there is a Euclidean motion (rotation and translation) of A that brings each member of A within distance " of some member of B. We establish upper bounds on the combinatorial complexity of this subproblem in model-based computer vision, when the sets A and B contain points, line segments, or ((lled-in)...